Precise values for the critical threshold for the three-dimensional “Swiss cheese” continuum percolation model have been calculated using extensive Monte Carlo simulations. These simulations used a growth algorithm and memory blocking scheme similar to what we used previously in three-dimensional lattice percolation. The simulations yield a value for the critical number density nc = 0.652 960±0.000 005,nc=0.652960±0.000005, which confirms recent work but extends the precision by two significant figures. © 2001 American Institute of Physics.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/70114/2/JCPSA6-114-8-3659-1.pd
Algorithms are presented for the computationally efficient manipulation of graphs. These are subseq...
Relevant aspects of the critical behavior of the site percolation model in a L×M geometry (L≪M) are ...
We introduce a method to estimate continuum percolation thresholds and illustrate its usefulness by ...
Percolation theory is a useful tool when modeling the random interconnectivity of the microscopic el...
In this dissertation we introduce and apply a new growth process methodology that provides rigorous ...
Percolation problems appear in a large variety of different contexts ranging from the design of comp...
We introduce a class of discrete-continuous percolation models and an efficient Monte Carlo algorith...
Results of numerical modeling of dilute 2D and 3D crystalline lattices are presented. The percola...
Monte Carlo simulations for a large family of discretized Boolean models exhibit complex dependencie...
Series estimates of the critical percolation probabilities and of the critical indices for the 'site...
We investigate the percolation thresholds of both random and invasion percolation in two and three d...
© 1999 IOP Publishing Ltd. We acknowledge interesting discussions with D Stauffer and R Ziff. We tha...
Using finite-size scaling methods we measure the thermal and magnetic exponents of the site percolat...
We study the percolation threshold for fully penetrable discs by measuring the average location of ...
We derive scaling laws for the percolation properties of an elongated lattice, i.e., those with dime...
Algorithms are presented for the computationally efficient manipulation of graphs. These are subseq...
Relevant aspects of the critical behavior of the site percolation model in a L×M geometry (L≪M) are ...
We introduce a method to estimate continuum percolation thresholds and illustrate its usefulness by ...
Percolation theory is a useful tool when modeling the random interconnectivity of the microscopic el...
In this dissertation we introduce and apply a new growth process methodology that provides rigorous ...
Percolation problems appear in a large variety of different contexts ranging from the design of comp...
We introduce a class of discrete-continuous percolation models and an efficient Monte Carlo algorith...
Results of numerical modeling of dilute 2D and 3D crystalline lattices are presented. The percola...
Monte Carlo simulations for a large family of discretized Boolean models exhibit complex dependencie...
Series estimates of the critical percolation probabilities and of the critical indices for the 'site...
We investigate the percolation thresholds of both random and invasion percolation in two and three d...
© 1999 IOP Publishing Ltd. We acknowledge interesting discussions with D Stauffer and R Ziff. We tha...
Using finite-size scaling methods we measure the thermal and magnetic exponents of the site percolat...
We study the percolation threshold for fully penetrable discs by measuring the average location of ...
We derive scaling laws for the percolation properties of an elongated lattice, i.e., those with dime...
Algorithms are presented for the computationally efficient manipulation of graphs. These are subseq...
Relevant aspects of the critical behavior of the site percolation model in a L×M geometry (L≪M) are ...
We introduce a method to estimate continuum percolation thresholds and illustrate its usefulness by ...